Graph factors modulo k

نویسنده

  • Carsten Thomassen
چکیده

We prove a general result on graph factors modulo k. A special case says that, for each natural number k, every (12k − 7)-edge-connected graph with an even number of vertices contains a spanning subgraph in which each vertex has degree congruent to k modulo 2k.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$Z_k$-Magic Labeling of Some Families of Graphs

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$  the group of integers modulo $k...

متن کامل

Graceful labelings of the generalized Petersen graphs

A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...

متن کامل

A Note on Waring ’ s Number Modulo

The Waring number of the integers modulo m with respect to k-th powers, denoted by ρ(m, k), is the smallest r such that every integer is a sum of r k-th powers modulo m. This number is also the diameter of an associated Cayley graph, called the Waring graph. In this paper this number is computed when m is a power of 2. More precisely the following result is obtained: Let n, s and b be natural n...

متن کامل

Cycles of even lengths modulo k

Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this is true for k ≥ 2 if the minimum degree is 2k − 1, which improves the previously known bound of 3k − 2. We also show that Thomassen’s conjecture is true for m = 2.

متن کامل

The Iteration Digraphs of Lambert Map Over the Local Ring $mathbb{Z}/p^kmathbb{Z}$ : Structures and Enumerations

Let $p$ be prime and $alpha:x mapsto xg^x$, the Discrete Lambert Map. For $kgeq 1,$ let $ V = {0, 1, 2, . . . , p^k-1}$. The iteration digraph is a directed graph with $V$ as the vertex set and there is a unique directed edge from $u$ to $alpha(u)$ for each $uin V.$ We denote this digraph by $G(g, p^{k}),$ where $gin (mathbb{Z}/p^kmathbb{Z})^*.$  In this piece of work, we investigate the struct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 106  شماره 

صفحات  -

تاریخ انتشار 2014